(No) More Marching Cubes
نویسنده
چکیده
Isosurfaces, one of the most fundamental volumetric visualization tools, are commonly rendered using the wellknown Marching Cubes cases that approximate contours of trilinearly-interpolated scalar fields. While a complete set of cases has recently been published by Nielson, the formal proof that these cases are the only ones possible and that they are topologically correct is difficult to follow. We present a more straightforward proof of the correctness and completeness of these cases based on a variation of the Dividing Cubes algorithm. Since this proof is based on topological arguments and a divide-and-conquer approach, this also sets the stage for developing tessellation cases for higher-order interpolants and for the quadrilinear interpolant in four dimensions. We also demonstrate that, apart from degenerate cases, Nielson’s cases are in fact subsets of two basic configurations of the trilinear interpolant.
منابع مشابه
Adaptive cube tessellation for topologically correct isosurfaces
Three dimensional datasets representing scalar fields are frequently rendered using isosurfaces. For datasets arranged as a cubic lattice, the marching cubes algorithm is the most used isosurface extraction method. However, the marching cubes algorithm produces some ambiguities which have been solved using different approaches that normally imply a more complex process. One of them is to tessel...
متن کاملMarching Cubes in an Unsigned Distance Field for Surface Reconstruction from Unorganized Point Sets
Surface reconstruction from unorganized point set is a common problem in computer graphics. Generation of the signed distance field from the point set is a common methodology for the surface reconstruction. The reconstruction of implicit surfaces is made with the algorithm of marching cubes, but the distance field of a point set can not be processed with marching cubes because the unsigned natu...
متن کاملQuality Isosurface Mesh Generation Using an Extended Marching Cubes Lookup Table
The Marching Cubes Algorithm may return degenerate, zero area isosurface triangles, and often returns isosurface triangles with small areas, edges or angles. We show how to avoid both problems using an extended Marching Cubes lookup table. As opposed to the conventional Marching Cubes lookup table, the extended lookup table differentiates scalar values equal to the isovalue from scalar values g...
متن کاملExtending Marching Cubes with Adaptative Methods to Obtain More Accurate Iso-surfaces
This work proposes an extension of the Marching Cubes algorithm, where the goal is to represent implicit functions with higher accuracy using the same grid size. The proposed algorithm displaces the vertices of the cubes iteratively until the stop condition is achieved. After each iteration, the difference between the implicit and the explicit representations is reduced, and when the algorithm ...
متن کاملGeneration of Myocardial Wall Surface Meshes from Segmented MRI
This paper presents a novel method for the generation of myocardial wall surface meshes from segmented 3D MR images, which typically have strongly anisotropic voxels. The method maps a premeshed sphere to the surface of the segmented object. The mapping is defined by the gradient field of the solution of the Laplace equation between the sphere and the surface of the object. The same algorithm i...
متن کامل